An Efficient Algorithm for Direction Finding against Unknown Mutual Coupling
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Direction Finding against Unknown Mutual Coupling
In this paper, an algorithm of direction finding is proposed in the presence of unknown mutual coupling. The preliminary direction of arrival (DOA) is estimated using the whole array for high resolution. Further refinement can then be conducted by estimating the angularly dependent coefficients (ADCs) with the subspace theory. The mutual coupling coefficients are finally determined by solving t...
متن کاملDirection Finding in the Presence of Mutual Coupling Direction Finding in the Presence of Mutual Coupling Direction Finding in the Presence of Mutual Coupling
The area of sensor array processing has attracted considerable interest in the signal processing community. The focus of this work has been on high resolution Direction Of Arrival (DOA) estimation algorithms that detect and locate aircrafts using radar systems. These algorithms exploit the fact that an electromagnetic wave that is received by an array of antenna elements reaches each element at...
متن کاملDirection finding and mutual coupling estimation for uniform rectangular arrays
A novel two-dimensional (2-D) direct-of-arrival (DOA) and mutual coupling coefficients estimation algorithm for uniform rectangular arrays (URAs) is proposed. A general mutual coupling model is first built based on banded symmetric Toeplitz matrices, and then it is proved that the steering vector of a URA in the presence of mutual coupling has a similar form to that of a uniform linear array (U...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2014
ISSN: 1424-8220
DOI: 10.3390/s141120064